On Optimal Interpolation by Linear Functions on n-Dimensional Cube
نویسندگان
چکیده
منابع مشابه
on the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولOn Optimal Points for Interpolation by Univariate Exponential Functions
We discuss the aysmptotics of the points that maximize the determinant of the interpolation matrix for interpolants of the form I1(x) = n ∑ i=1 aie αxti and I2(x) = n ∑
متن کاملOptimal hash functions for approximate closest pairs on the n-cube
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecting an n-cube onto k bits is simple hash function that performs well. In this paper we investigate alternatives to projection. For various parameters hash functions given by complete decoding algorithms for codes work b...
متن کاملLinear transformations of monotone functions on the discrete cube
For a function f : {0, 1} → R and an invertible linear transformation L ∈ GLn(2), we consider the function Lf : {0, 1} → R defined by Lf(x) = f(Lx). We raise two conjectures: First, we conjecture that if f is Boolean and monotone then I(Lf) ≥ I(f), where I(f) is the total influence of f . Second, we conjecture that if both f and L(f) are monotone, then f = L(f) (up to a permutation of the coord...
متن کاملOn a property of the $n$-dimensional cube
We show that in any subset of the vertices of n-dimensional cube that contains at least 2 n−1 + 1 vertices (n ≥ 4), there are four vertices that induce a claw, or there are eight vertices that induce the cycle of length eight.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatic Control and Computer Sciences
سال: 2018
ISSN: 0146-4116,1558-108X
DOI: 10.3103/s0146411618070283